Avoiding Two-Bit Crossovers in Genetic Programming
نویسندگان
چکیده
We investigate the utility of weighting the crossover points in genetic programming. The depth-fair crossover (DFC) operator is introduced as an alternative to the standard 90=10 weight heuristic. The DFC weight heuristic performs better that the standard 90=10 weight heuristic in the clique domain. Preliminary results also indicate it will perform better in other applications.
منابع مشابه
Genetic algorithm for Echo cancelling
In this paper, echo cancellation is done using genetic algorithm (GA). The genetic algorithm is implemented by two kinds of crossovers; heuristic and microbial. A new procedure is proposed to estimate the coefficients of adaptive filters used in echo cancellation with combination of the GA with Least-Mean-Square (LMS) method. The results are compared for various values of LMS step size and diff...
متن کاملAn Analysis on Crossovers for Real Number Chromosomes in an Infinite Population Size
In this paper, as one approach for mathematical analysis of evolutionary algorithms with real number chromosomes, we focus our attention on crossovers, give a general framework of the description for the change of the distribution of the population through them, and verify the properties of crossovers based on the framework. This framework includes various crossover which have been proposed and...
متن کاملDistributed Modified Extremal Optimization for Reducing Crossovers in Reconciliation Graph
To determine the mechanism of molecular evolution, a reconciliation graph is constructed from two heterogeneous trees, which are referred to as ordered trees. In the reconciliation graph, the leaf nodes of the two ordered trees face each other. Furthermore, leaf nodes with the same label name are connected to each other by an edge. To carry out reconciliation work efficiently, it is necessary t...
متن کاملOn the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms
With a schema-theoretic approach and experiments we study the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations where the population pres...
متن کاملOn The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms
In this paper we study with a schema-theoretic approach and experiments the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are totally unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations whe...
متن کامل